/*
 * Copyright (c) 2025, 2025, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * The Universal Permissive License (UPL), Version 1.0
 *
 * Subject to the condition set forth below, permission is hereby granted to any
 * person obtaining a copy of this software, associated documentation and/or
 * data (collectively the "Software"), free of charge and under any and all
 * copyright rights in the Software, and any and all patent rights owned or
 * freely licensable by each licensor hereunder covering either (i) the
 * unmodified Software as contributed to or provided by such licensor, or (ii)
 * the Larger Works (as defined below), to deal in both
 *
 * (a) the Software, and
 *
 * (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if
 * one is included with the Software each a "Larger Work" to which the Software
 * is contributed by such licensors),
 *
 * without restriction, including without limitation the rights to copy, create
 * derivative works of, display, perform, and distribute the Software and make,
 * use, sell, offer for sale, import, export, have made, and have sold the
 * Software and the Larger Work(s), and to sublicense the foregoing rights on
 * either these or other terms.
 *
 * This license is subject to the following condition:
 *
 * The above copyright notice and either this complete permission notice or at a
 * minimum a reference to the UPL must be included in all copies or substantial
 * portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
package com.oracle.truffle.regex.tregex.nodes.dfa;

import com.oracle.truffle.api.CompilerAsserts;
import com.oracle.truffle.api.CompilerDirectives.CompilationFinal;
import com.oracle.truffle.api.nodes.ExplodeLoop;
import com.oracle.truffle.regex.tregex.automaton.TransitionConstraint;

public class DFABQTrackingStateNode extends DFAStateNode {

    @CompilationFinal(dimensions = 2) private final long[][] unAnchoredFinalConstraints;
    @CompilationFinal(dimensions = 2) private final long[][] anchoredFinalConstraints;

    public DFABQTrackingStateNode(short id, byte flags, short loopTransitionIndex, short indexOfNodeId, byte indexOfIsFast,
                    short[] successors,
                    Matchers matchers,
                    long[][] unAnchoredFinalConstraints,
                    long[][] anchoredFinalConstraints) {
        super(id, flags, loopTransitionIndex, indexOfNodeId, indexOfIsFast, successors, matchers, (short) -1);
        this.unAnchoredFinalConstraints = unAnchoredFinalConstraints;
        this.anchoredFinalConstraints = anchoredFinalConstraints;
    }

    @ExplodeLoop
    @Override
    boolean checkFinalState(TRegexDFAExecutorLocals locals, TRegexDFAExecutorNode executor) {
        CompilerAsserts.partialEvaluationConstant(this);
        CompilerAsserts.partialEvaluationConstant(executor);
        if (isFinalState()) {
            storeResult(locals, executor, false);
            return true;
        } else if (isGuardedFinalState()) {
            for (long[] cs : unAnchoredFinalConstraints) {
                assert cs.length > 0;
                if (constraintsAreSatisfied(locals, executor, cs)) {
                    storeResult(locals, executor, false);
                    return true;
                }
            }
        }
        return false;
    }

    @ExplodeLoop
    @Override
    void atEnd(TRegexDFAExecutorLocals locals, TRegexDFAExecutorNode executor, boolean inputAtEnd) {
        CompilerAsserts.partialEvaluationConstant(this);
        CompilerAsserts.partialEvaluationConstant(executor);
        super.atEnd(locals, executor, inputAtEnd);
        boolean guardedAnchored = isGuardedAnchoredFinalState() && inputAtEnd;
        if (isGuardedFinalState()) {
            for (long[] cs : unAnchoredFinalConstraints) {
                if (constraintsAreSatisfied(locals, executor, cs)) {
                    storeResult(locals, executor, false);
                    return;
                }
            }
        }
        if (guardedAnchored) {
            for (long[] cs : anchoredFinalConstraints) {
                if (constraintsAreSatisfied(locals, executor, cs)) {
                    storeResult(locals, executor, true);
                    return;
                }
            }
        }
    }

    @ExplodeLoop
    private static boolean constraintsAreSatisfied(TRegexDFAExecutorLocals locals, TRegexDFAExecutorNode executor, long[] constraints) {
        CompilerAsserts.partialEvaluationConstant(executor);
        CompilerAsserts.partialEvaluationConstant(constraints);
        for (long constraint : constraints) {
            int qId = TransitionConstraint.getQuantifierID(constraint);
            CompilerAsserts.partialEvaluationConstant(constraint);
            CompilerAsserts.partialEvaluationConstant(qId);
            CounterTracker counterTracker = executor.getCounterTrackers()[qId];
            CompilerAsserts.partialEvaluationConstant(counterTracker);
            if (!counterTracker.canExecute(constraint, locals.getFixedData(), locals.getIntArrays())) {
                return false;
            }
        }
        return true;
    }
}
